Computing Bisimulations for Stochastic Process Algebras using Symbolic Representations
نویسندگان
چکیده
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addresses the computational complexity of minimisation algorithms and explains how efficient, BDD-based data structures can be employed for this purpose.
منابع مشابه
Activity-local symbolic state graph generation for high-level stochastic models
This paper introduces a new, efficient method for deriving compact symbolic representations of very large (labelled) Markov chains resulting from high-level model specifications such as stochastic Petri nets, stochastic process algebras, etc.. This so called “activity-local” scheme is combined with a new data structure, called zero-suppressed multi-terminal binary decision diagram, and a new ef...
متن کاملAdvances in Model Representations
We review high-level speciication formalisms for Markovian performability models, thereby emphasising the role of structuring concepts as realised par excellence by stochastic process algebras. Symbolic representations based on decision diagrams are presented, and it is shown that they quite ideally support compositional model construction and analysis.
متن کاملDeriving Symbolic Representations from Stochastic Process Algebras
A new denotational semantics for a variant of the stochastic process algebra TIPP is presented, which maps process terms to Multiterminal binary decision diagrams. It is shown that the new semantics is Markovian bisimulation equivalent to the standard SOS semantics. The paper also addresses the difficult question of keeping the underlying state space minimal at every construction step.
متن کاملCompositional Reduction of Performability Models based on Stochastic Process Algebras
Stochastic Process Algebras (SPA) have been proposed as compositional specification formalisms for quantitative models. Here we apply these compositional features to SPAs extended by rewards. State space reduction of performability models can be achieved based on the behaviour-preserving notion of Markov Reward Bisimulation. For a framework extended by immediate actions we develop a new equival...
متن کاملStochastic Process Algebra with Value-Passing and Weak Time Restrictions
Process algebra provides essential tools for studying distributed and concurrent systems. Stochastic process algebra (i.e., YAWN ) enhances the process algebra with stochastic extensions which is perfect to analyze phenomena of process with executing durations in the real world. What’s more, in system runs, value passing is tightly bounded with their processes. However, stochastic process algeb...
متن کامل